Directed Distances with Derivatives
نویسندگان
چکیده
منابع مشابه
Distances in the directed configuration model
We analyze the distribution of the distance between two nodes, sampled uniformly at random, in digraphs generated via the directed configuration model. Under the assumption that the covariance between the in-degree and out-degree is finite, we show that the distance grows logarithmically in the size of the graph. In contrast with the undirected case, this can happen even when the variance of th...
متن کاملTypical Distances in the Directed Configuration Model
We analyze the distribution of the distance between two nodes, sampled uniformly at random, in digraphs generated via the directed configuration model, in the supercritical regime. Under the assumption that the covariance between the in-degree and out-degree is finite, we show that the distance grows logarithmically in the size of the graph. In contrast with the undirected case, this can happen...
متن کاملPolyhedral Split Decomposition of Tropical Polytopes for Directed Distances
In the last decade, tropical geometry has been attracted a lot of attention in various fields such as the algebraic geometry, computational biology, and physics. The tropical polytope in the tropical geometry was introduced by Develin and Sturmfels as a counterpart of the polytope in the (ordinal) geometry. Recently, in the theory of directed multiflows, it has been shown by Hirai and the autho...
متن کاملA Goal-Directed Shortest Path Algorithm Using Precomputed Cluster Distances
This thesis introduces a new acceleration heuristic for shortest path queries, called the PCD algorithm (Precomputed Cluster Distances). PCD precomputes shortest path distances between the partitions of the input graph, which can be obtained by any graph partitioning method. Since the number of partitions can be varied between one and the number of nodes, the method presents an interpolation be...
متن کاملComputing the Minimum Directed Distances Between Convex Polyhedra
Given two disjointed objects, the minimum distance (MD) is the short Euclidean distance between them. When the two objects intersect, the MD between them is zero. The minimum directed Euclidean distance (MDED) between two objects is the shortest relative translated Euclidean distance that results in the objects coming just into contact. The MDED is also defined for intersecting objects, and it ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1994
ISSN: 0022-247X
DOI: 10.1006/jmaa.1994.1197